Discrete Mathematics - PDFSEARCH.IO - Document Search Engine

Discrete Mathematics
Results: 2210

#	Item
151	The Partition Technique for Overlays of Envelopes∗ Vladlen Koltun† Micha Sharir‡ Abstract Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2009-04-29 21:59:48 Mathematics Analysis of algorithms Discrete mathematics Number theory Mathematical analysis Combinatorics Partition Time complexity E-function Big O notation
152	Theorem 1. If F (n) is the number of Friedman numbers in the range [1, n], then lim F (n)/n = 1. n→∞ In order to prove this claim, we begin by defining a class of integers that will be used throughout the proof. Add to Reading List Source URL: www2.stetson.edu Language: English - Date: 2010-06-20 20:24:24 Mathematics Discrete mathematics Combinatorics Friedman number Factorial Permutation Integer Combination Pi Transposable integer Harshad number
153	PERMUTATIONS and COMBINATIONS Add to Reading List Source URL: www.stat.wisc.edu Language: English - Date: 2010-07-21 22:05:42 Mathematics Combinatorics Discrete mathematics Permutation Ordered pair Twelvefold way Factorial Binomial coefficient Combination Random permutation statistics Independence of irrelevant alternatives
154	A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany Add to Reading List Source URL: www.cits.rub.de Language: English - Date: 2014-11-18 10:03:56 Abstract algebra Algebra Mathematics Group theory Discrete logarithm Index calculus algorithm PohligHellman algorithm Baby-step giant-step Limit of a function
155	Approximating Fixation Probabilities in the Generalized Moran Process∗ Josep D´ıaz†, Leslie Ann Goldberg‡, George B. Mertzios§, David Richerby‡, Maria Serna† and Paul G. Spirakis¶ Abstract Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-11-17 17:59:55 Graph theory Mathematics Discrete mathematics Degree Graph Random graph Evolutionary graph theory Logic of graphs
156	Local Partitioning using PageRank Reid Andersen Fan Chung UCSD, UCSD, Yahoo! Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2006-11-11 09:59:27 Graph theory Mathematics Discrete mathematics NP-complete problems Algebraic graph theory Crowdsourcing PageRank Graph partition Connectivity Conductance Graph
157	SIAM J. DISCRETE MATH. Vol. 29, No. 2, pp. 835–853 c 2015 Society for Industrial and Applied Mathematics Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2015-04-28 08:29:58 Graph theory Bipartite graphs Tree Chordal graph Cycle Graph coloring Geometric group theory Graph connectivity Spectral theory of ordinary differential equations Vertex separator
158	Large Networks V. Batagelj Pajek Network visualization Add to Reading List Source URL: essir.uni-koblenz.de Language: English - Date: 2016-02-24 18:38:54 Network theory Vladimir Batagelj Graph theory Graph drawing Complex network Graph Mathematics Discrete mathematics Software Social network analysis software
159	Microsoft Word - IJIMA03-02.docx Add to Reading List Source URL: www.foibg.com Language: English - Date: 2015-02-02 08:39:31 Error detection and correction Information theory Turbo code Forward error correction Discrete mathematics
160	Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2006-01-18 08:08:22 Graph theory Chordal graph Chordal completion Tree Graph coloring Graph connectivity Treewidth Vertex separator

UPDATE